Approximation methods for the distributed order calculus using the convolution quadrature
نویسندگان
چکیده
In this article we generalize the convolution quadrature (CQ) method, which aims at approximating fractional calculus, to case for distributed order calculus. Our method is a natural expansion that approximation formulas, convergence results and correction technique reduce cases CQ if weight function $ \mu(\alpha) defined by \delta(\alpha-\alpha_0) $. Further, explore new structure of solution an ODE with derivative, differs from those solutions traditional ODEs, propose restore optimal rate. Numerical tests smooth nonsmooth confirm our theoretical efficiency technique.
منابع مشابه
the use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولQuadrature for the Finite Free Convolution
These notes are not necessarily an accurate representation of what happened in class. The notes written before class say what I think I should say. I sometimes edit the notes after class to make them way what I wish I had said. There may be small mistakes, so I recommend that you check any mathematically precise statement before using it in your own work. These notes were last revised on Decemb...
متن کاملRunge-kutta Methods for Parabolic Equations and Convolution Quadrature
We study the approximation properties of Runge-Kutta time discretizations of linear and semilinear parabolic equations, including incompressible Navier-Stokes equations. We derive asymptotically sharp error bounds and relate the temporal order of convergence, which is generally noninteger, to spatial regularity and the type of boundary conditions. The analysis relies on an interpretation of Run...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Continuous Dynamical Systems-series B
سال: 2021
ISSN: ['1531-3492', '1553-524X']
DOI: https://doi.org/10.3934/dcdsb.2020168